Projected Newton method for noise constrained Tikhonov regularization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quadratic regularization projected alternating Barzilai–Borwein method for constrained optimization

In this paper, based on the regularization techniques and projected gradient strategies, we present a quadratic regularization projected alternating Barzilai–Borwein (QRPABB) method for minimizing differentiable functions on closed convex sets. We show the convergence of the QRPABB method to a constrained stationary point for a nonmonotone line search. When the objective function is convex, we ...

متن کامل

Convergence rates in constrained Tikhonov regularization: equivalence of projected source conditions and variational inequalities

In this paper, we enlighten the role of variational inequalities for obtaining convergence rates in Tikhonov regularization of nonlinear ill-posed problems with convex penalty functionals under convexity constraints in Banach spaces. Variational inequalities are able to cover solution smoothness and the structure of nonlinearity in a uniform manner, not only for unconstrained but, as we indicat...

متن کامل

A Parameter Choice Method for Tikhonov Regularization

Abstract. A new parameter choice method for Tikhonov regularization of discrete ill-posed problems is presented. Some of the regularized solutions of a discrete ill-posed problem are less sensitive than others to the perturbations in the right-hand side vector. This method chooses one of the insensitive regularized solutions using a certain criterion. Numerical experiments show that the new met...

متن کامل

Projected Tikhonov Regularization of Large-Scale Discrete Ill-Posed Problems

The solution of linear discrete ill-posed problems is very sensitive to perturbations in the data. Confidence intervals for solution coordinates provide insight into the sensitivity. This paper presents an efficient method for computing confidence intervals for large-scale linear discrete ill-posed problems. The method is based on approximating the matrix in these problems by a partial singular...

متن کامل

Modulus-based iterative methods for constrained Tikhonov regularization

Tikhonov regularization is one of the most popular methods for the solution of linear discrete ill-posed problems. In many applications the desired solution is known to lie in the nonnegative cone. It is then natural to require that the approximate solution determined by Tikhonov regularization also lies in this cone. The present paper describes two iterative methods, that employ modulus-based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Inverse Problems

سال: 2020

ISSN: 0266-5611,1361-6420

DOI: 10.1088/1361-6420/ab7d2b